Algorithms and complexity for periodic real-time scheduling

A Algorithms and Complexity for Periodic Real-Time Scheduling

We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no pseudopolynomial time algorithm can test the feasibility of a task system within a constant speedup bound, unless P = NP. This result contrasts with recent results for sporadic task systems. For two special cases, synchronous task systems and systems with a constant nu...

Scheduling Real-time Tasks: Algorithms and Complexity∗

Real-Time Scheduling Algorithms

Real-time systems play an important role in our modern society. They are used in critical control systems that rely on timely response and computed results to function properly. This paper summarizes to an extent the state of real-time systems in the area of scheduling. A vast amount of work that has been done in the area of real-time scheduling by both the operations research and the computer ...

Genetic Algorithms for Complex, Real-Time Scheduling

Real-time scheduling of large-scale problems in complex domains presents a number of difficulties for search and optimization techniques, including: (i) large and complex search spaces, (ii) dynamically changing problems, and (iii) a variety of problemdependent constraints and preferences. Genetic algorithms are well suited to such problems due to their adaptability and their effectiveness at s...

Scheduling Algorithms for Real-Time Systems

The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the characteristics and constraints of real-time tasks which should be scheduled to be executed. Analysis methods and the concept of optimality criteria, which leads to design appropriate scheduling algorithms, wi...